A note on upper bounds for minimum distance codes
نویسندگان
چکیده
منابع مشابه
Upper bounds on the minimum distance of spherical codes
We use linear programming techniques to obtain new upper bounds on the maximal squared minimum distance of spherical codes with fixed cardinality. Functions Qj(n, s) are introduced with the property that Qj(n, s) < 0 for some j > m iff the Levenshtein bound Lm(n, s) on A(n, s) = max{|W | : W is an (n, |W |, s) code} can be improved by a polynomial of degree at least m+1. General conditions on t...
متن کاملDistance upper bounds and true minimum distance results for Turbo-Codes designed with DRP interleavers
Stewart Crozier received his B.Sc. degree in applied mathematics and engineering from Queen's University, Kingston, Canada in 1979. He received his M.Eng. and Ph.D. degrees in systems engineering from Carleton University, Ottawa, Canada in 1983 and 1990 respectively. He is currently a research scientist with the Communications Research Centre, Ottawa, Canada. His primary research interests are ...
متن کاملA Note on the Minimum Distance of Quantum LDPC Codes
We provide a new lower bound on the minimum distance of a family of quantum LDPC codes based on Cayley graphs proposed by MacKay, Mitchison and Shokrollahi [13]. Our bound is exponential, improving on the quadratic bound of Couvreur, Delfosse and Zémor [3]. This result is obtained by examining a family of subsets of the hypercube which locally satisfy some parity conditions.
متن کاملUpper Bounds on the Minimum Distance of Quasi-Cyclic LDPC codes Revisited
In this paper we investigate the minimum code distance of QC LDPC codes [1], [2], [3]. These codes form an important subclass of LDPC codes [4], [5]. These codes also are a subclass of protograph-based LDPC codes [6]. QC LDPC codes can be easily stored as their parity-check matrices can be easily described. Besides such codes have efficient encoding [7] and decoding [8] algorithms. All of these...
متن کاملGeneralized upper bounds on the minimum distance of PSK block codes
This paper generalizes previous optimal upper bounds on the minimum Euclidean distance for phase shift keying (PSK) block codes, that are explicit in three parameters: alphabet size, block length and code size. The bounds are primarily generalized from codes over symmetric PSK to codes over asymmetric PSK and also to general alphabet size. Furthermore, block codes are optimized in the presence ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1958
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(58)80006-6